Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
نویسندگان
چکیده
منابع مشابه
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
We reformulate the zero-norm minimization problem as an equivalent mathematical program with equilibrium constraints and establish that its penalty problem, induced by adding the complementarity constraint to the objective, is exact. Then, by the special structure of the exact penalty problem, we propose a decomposition method that can seek a global optimal solution of the zero-norm minimizatio...
متن کاملAn Exact Penalty Method for Binary Optimization Based on MPEC Formulation
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques, which is based on Mathematical Programming with Equilibrium Constraints (MPECs). We first reformulate the binary program as an equivalent augmented biconvex optimization problem with a bilinear equality cons...
متن کاملPenalty Decomposition Methods for $L0$-Norm Minimization
In this paper we consider general l0-norm minimization problems, that is, the problems with l0-norm appearing in either objective function or constraint. In particular, we first reformulate the l0-norm constrained problem as an equivalent rank minimization problem and then apply the penalty decomposition (PD) method proposed in [33] to solve the latter problem. By utilizing the special structur...
متن کاملPenalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result, we then propose penalty decomposition methods for general rank minimization problems in which each subproblem is solved by a block coordinate descend method...
متن کاملAn implicit formulation for exact BDD minimization
This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don’t caresets. Specifically, given an incompletely specified function g and a fixed ordering of the variables, we propose anexact algorithm for selectingf such that f is a cover for g and the binary decision diagram for f is of minimumsize. The approach described is the only kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110855867